A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
نویسندگان
چکیده
منابع مشابه
Polynomial - time Approximation Scheme for Euclidean TSP
We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances between cities are Euclidean. This result, independently due to Arora and Mitchell [1, 6], hinges on a powerful technique for randomly decomposing the given graph into regions, such that dependency amongst optimal solutions to each region has a “nice” structure. In fa...
متن کاملPolynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
Abst ract Given a set N of n terminals in the rst quadrant of the Euclidean plane E 2 , nd a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horiz on tal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem. which has been proved to be NP-complete recentl...
متن کاملPolynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, ...
متن کاملAn efficient polynomial-time approximation scheme for Steiner forest in planar graphs
We give an O(n log n) approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in O(n ) time. ∗Department of Computer Science, Brown University. Supported in part by NSF grant CCF-0964037.
متن کاملA Polynomial - Time Subpolynom - Approximation Scheme for
The acyclic directed Steiner tree problem (ADSP) requires a minimal outward tree within an acyclic digraph with edge costs G = (V; E; d) which connects a root r with a distinguished subset S V , #S = k. The best possible performance guarantee of any polynomial approximation algorithm for ADSP cannot be less than 1 4 log k unless ~ P NP. The presented series of heuristics A n has a performance g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2015
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2629654